Convergence of preconditioned iterative methods

Improvements of two preconditioned AOR iterative methods for Z-matrices

‎In this paper‎, ‎we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix‎. ‎These methods can be considered as improvements of two previously presented ones in the literature‎. ‎Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners‎.‎

Convergence of iterative methods applied to Burgers-Huxley equation

Preconditioned Iterative Methods for Homotopy Curve Tracking

Homotopy algorithms are a class of methods for solving systems of nonlinear equations that are globally convergent with probability one. All homotopy algorithms are based on the construction of an appropriate homotopy map and then the tracking of a curve in the zero set of this homotopy map. The fundamental linear algebra step in these algorithms is the computation of the kernel of the homotopy...

Preconditioned Iterative Methods for Scattered Data Interpolation

Tom Lyche, a Trygve K. Nilssen, b and Ragnar Winther c,∗ a Department of Informatics, University of Oslo, P.O. Box 1080 Blindern, 0316 Oslo, Norway E-mail: [email protected] b Department of Mathematics, University of Bergen, Johannes Brunsgt. 12, 5007 Bergen, Norway E-mail: [email protected] c Department of Informatics and Department of Mathematics, University of Oslo, P.O. Box 1080 Blinder...

Preconditioned Iterative Methods in a Subspace

We consider a family of symmetric matrices A! = A 0 + !B; with a nonnegative deenite matrix A 0 ; a positive deenite matrix B; and a nonnegative parameter ! 1: Small ! leads to a poor conditioned matrix A! with jumps in the coeecients. For solving linear algebraic equations with the matrix A!; we use standard preconditioned iterative methods with the matrix B as a preconditioner. We show that a...